LUCAS OR LUCANUS?
نویسندگان
چکیده
منابع مشابه
Identities Involving Lucas or Fibonacci and Lucas Numbers as Binomial Sums
As in [1, 2], for rapid numerical calculations of identities pertaining to Lucas or both Fibonacci and Lucas numbers we present each identity as a binomial sum. 1. Preliminaries The two most well-known linear homogeneous recurrence relations of order two with constant coefficients are those that define Fibonacci and Lucas numbers (or Fibonacci and Lucas sequences). They are defined recursively ...
متن کاملLucas Sequences Whose 12th or 9th Term Is a Square
The sequence {Un(1,−1)} is the familiar Fibonacci sequence, and it was proved by Cohn [12] in 1964 that the only perfect square greater than 1 in this sequence is U12 = 144. The question arises, for which parameters P , Q, can Un(P,Q) be a perfect square? This has been studied by several authors: see for example Cohn [13] [14] [15], Ljunggren [22], and Robbins [25]. Using Baker’s method on line...
متن کاملLucas-sierpiński and Lucas-riesel Numbers
In this paper, we show that there are infinitely many Sierpiński numbers in the sequence of Lucas numbers. We also show that there are infinitely many Riesel numbers in the sequence of Lucas numbers. Finally, we show that there are infinitely many Lucas numbers that are not a sum of two prime powers.
متن کاملLucas News
The RSL continues to evolve and two faculty recruitments are in progress for molecular imaging and cognitive neuroimaging. These are major initiatives for the Department and the Lab. Molecular imaging is broadly defined as the visualization of in vivo structures that are identified on the molecular level by genetic expression or some other tagging means. The NIH has recently highlighted this fi...
متن کاملLucas Primitive Roots
is called the characteristic polynomial of the sequence U. In the case where P = -g = 1, the sequence U is the Fibonacci sequence and we denote its terms by F0, Fl9 F2, ... . Let p be an odd prime with p\Q and let e > 1 be an integer. The positive integer u = u(p) is called the rank of apparition of p in the sequence U if p\Uu and p\Um for 0 < m < u; furthermore, u = u(p) is called the period o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Theological Studies
سال: 1905
ISSN: 0022-5185,1477-4607
DOI: 10.1093/jts/os-vi.23.435